منابع مشابه
Mixing Time of Markov chain of the Knapsack Problem
To find the number of assignments of zeros and ones satisfying a specific Knapsack Problem is #P hard, so only approximations are envisageable. A Markov chain allowing uniform sampling of all possible solutions is given by Luby, Randall and Sinclair. In 2005, Morris and Sinclair, by using a flow argument, have shown that the mixing time of this Markov chain is O(n), for any ǫ > 0. By using a ca...
متن کاملA Note on Markov Chain Monte Carlo Sweep Strategies
Markov chain Monte Carlo (MCMC) routines have become a fundamental means for generating random variates from distributions otherwise difficult to sample. The Hastings sampler, which includes the Gibbs and Metropolis samplers as special cases, is the most popular MCMC method. A number of implementations are available for running these MCMC routines varying in the order through which the componen...
متن کاملA note on the extension complexity of the knapsack polytope
We show that there are 0-1 and unbounded knapsack polytopes with super-polynomial extension complexity. More specifically, for each n ∈ N we exhibit 0-1 and unbounded knapsack polyhedra in dimension n with extension complexity Ω(2 p n).
متن کاملRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملthe effects of cognitive strategies- note making and underlining- on iranian efl learners’ reading comprehension
هدف از انجام این مطالعه ، بررسی اثرات استفاده از استراتژی های شناختی یعنی "نت برداری" و "زیر خط کردن" بر روی عملکرد درک مطلب زبان آموزان ایرانی می باشد. به این منظور، 60 زبان آموز دختر سال چهارم دبیرستان از طریق آزمون پیشرفت زبان انگلیسی (نلسون)، از یک جامعه آماری بزرگتر انتخاب شدند. سپس به صورت تصادفی به سه گروه که هر گروه شامل ?0 دانش آموز همسان بود، تقسیم شدند: دو گروه آزمایش(گروه "نت برداری...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2001
ISSN: 0304-4149
DOI: 10.1016/s0304-4149(01)00080-1